Optimization methods to solve the set covering problems
نویسندگان
چکیده
Phasor Measurement Unit Placement aims to decrease the cost this phasor equipment while maintaining observability of electrical distribution systems. This placement can be modeled as a set covering problem. Synchronized data provides systems’ information with higher quality and frequency than Remote Terminal Units. These enable implementation faster real-time state estimators. Thus, supervisory control acquisition systems replaced by automatically monitored that add reliability, efficiency, resilience smart grid Due flexibility large-scale in systems, heuristic methods have frequently been applied Since use Chemical Reaction Optimization (CRO) algorithm is not recurrent, we decided implement it together topological system analysis. Initial population creation, parameterization, elementary reactions CRO, local search strategies are presented study. Computational results were performed IEEE power test cases. The optimization method proposed has obtained optimal at lower computation time literature. To large-scale, another Set Covering Problems from Beasley library, different parameters. However, satisfactory indicating CRO might suitable some instances library. In case, further studies required.
منابع مشابه
Evolutionary Search Techniques to Solve Set Covering Problems
Set covering problem is a classical problem in computer science and complexity theory. It has many applications, such as airline crew scheduling problem, facilities location problem, vehicle routing, assignment problem, etc. In this paper, three different techniques are applied to solve set covering problem. Firstly, a mathematical model of set covering problem is introduced and solved by using...
متن کاملUsing the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem
The Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, we present a novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on th...
متن کاملA GRASP algorithm to solve the unicost set covering problem
The set covering problem (SCP) is a wellknown combinatorial optimization problem. We present a GRASP algorithm to Unicost Set Covering Problem, a special case of the Set Covering Problem where no distinction is made between covering sets. The most significant contribution of the algorithm is the incorporation of a local improvement procedure based on the heuristics to solve satisfiability probl...
متن کاملSet Covering Problems
Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple systems do indeed give rise to a series of problems that are probably hard to solve by implicit enumera...
متن کاملAn interior point algorithm to solve computationally difficult set covering problems
We present an interior point approach to the zero-one integer programming feasibility problem based on the minimization of a nonconvex potential function. Given a poly-tope defined by a set of linear inequalities, this procedure generates a sequence of strict interior points of this polytope, such that each consecutive point reduces the value of the potential function. An integer solution (not ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Contribuciones a las ciencias sociales
سال: 2023
ISSN: ['1988-7833']
DOI: https://doi.org/10.55905/revconv.16n.9-237